OVERLAYING SURFACE MESHES, PART I: ALGORITHMS
نویسندگان
چکیده
منابع مشابه
Overlaying surface meshes, part I: algorithms
We describe an efficient and robust algorithm for computing a common refinement of two meshes modeling the'same surface of arbitrary shape by overlaying them on lop of each other. A common refinement is an important data structure for transferring data between meshes that have different combinatorial structures. Our algorithm is optimal in time and space, with linear complexity, and is robust e...
متن کاملOverlaying surface meshes, part II: topology preservation and feature matching
In Part I, we described an efficient and robust algorithm for computing a common refinement of two surface meshes. In this paper, we present a theoretical verification ofthe robustness of our algorithm by showing the topological preservation of the intersection principle, which we used to resolve topological inconsistencies caused by numerical errors. To enhance robustness in practice for compl...
متن کاملEfficient and Robust Algorithm for Overlaying Nonmatching Surface Meshes
This paper describes an efficient and robust algorithm for computing a common refinement of two meshes modeling a common surface of arbitrary shape by overlaying them on top of each other. A common refinement is an important data structure for transferring data between meshes that have different topological structures. Our algorithm is optimal in time and space, with linear complexity. Special ...
متن کامل3B.4 Overlaying Surface Meshes: Extension and Parallelization
Many computational applications involve multiple physical components and require exchanging data across the interface between them, often on parallel computers. The interface is typically represented by surface meshes that are non-matching, with differing connectivities and geometry. To transfer data accurately and conservatively, it is important to construct a common refinement (or common tess...
متن کاملSelective Re nement of Surface Meshes: Data Structures and Algorithms
Selective reenement is an operation acting on multiresolution surface models, aimed to provide a mesh approximation with a resolution variable over the surface. We address some eeciency issues related to selective reenement, and we present some results on data structures and algorithms that work on a multiresolution triangle-based model, called a Multi-Triangulation. In particular, we analyze t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2004
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195904001512